Faster Mean-shift: GPU-accelerated clustering for cosine embedding-based cell segmentation and tracking

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GPU Enabled Parallel Touching Cell Segmentation Using Mean Shift Based Seed Detection and Repulsive Level Set

Automated image analysis of histopathology specimens could potentially provide support for the early detection of breast cancer. Automated segmentation of cells in the digitized tissue microarray (TMA) is a prerequisite for quantitative analysis. However touching cells bring significant challenges for traditional segmentation algorithms. In this paper, we propose a novel algorithm to separate t...

متن کامل

The Approach of Mean Shift based Cosine Dissimilarity for Multi-Recording Speaker Clustering

Speaker clustering is an important task in many applications such as Speaker Diarization as well as Speech Recognition. Speaker clustering can be done within a single multispeaker recording (Diarization) or for a set of different recordings. In this work we are interested by the former case and we propose a simple iterative Mean Shift (MS) algorithm. MS algorithm is based on Euclidean distance....

متن کامل

Image Segmentation: Type–2 Fuzzy Possibilistic C-Mean Clustering Approach

Image segmentation is an essential issue in image description and classification. Currently, in many real applications, segmentation is still mainly manual or strongly supervised by a human expert, which makes it irreproducible and deteriorating. Moreover, there are many uncertainties and vagueness in images, which crisp clustering and even Type-1 fuzzy clustering could not handle. Hence, Type-...

متن کامل

GPU Accelerated Likelihoods for Stereo-Based Articulated Tracking

For many years articulated tracking has been an active research topic in the computer vision community. While working solutions have been suggested, computational time is still problematic. We present a GPU implementation of a ray-casting based likelihood model that is orders of magnitude faster than a traditional CPU implementation. We explain the non-intuitive steps required to attain an opti...

متن کامل

G-DBSCAN: A GPU Accelerated Algorithm for Density-based Clustering

With the advent of Web 2.0, we see a new and differentiated scenario: there is more data than that can be effectively analyzed. Organizing this data has become one of the biggest problems in Computer Science. Many algorithms have been proposed for this purpose, highlighting those related to the Data Mining area, specifically the clustering algorithms. However, these algorithms are still a compu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Medical Image Analysis

سال: 2021

ISSN: 1361-8415

DOI: 10.1016/j.media.2021.102048